Probabilistic Verification over GF(2m) Using Mod2-OBDDs
نویسنده
چکیده
Formal verification is fundamental in many phases of digital systems design. The most successful verification procedures employ Ordered Binary Decision Diagrams (OBDDs) as canonical representation for both Boolean circuit specifications and logic designs, but these methods require a large amount of memory and time. Due to these limitations, several models of Decision Diagrams have been studied and other verification techniques have been proposed. In this paper, we have used probabilistic verification with Galois (or finite) field GF(2) modifying the CUDD package for the computation of signatures in classical OBDDs, and for the construction of Mod2-OBDDs (also known as -OBDDs). Mod2-OBDDs have been constructed with a two-level layer of -nodes using a positive Davio expansion (pDE) for a given variable. The sizes of the Mod2-OBDDs obtained with our method are lower than the Mod2-OBDDs sizes obtained with other similar methods.
منابع مشابه
Verification of composite Galois field multipliers over GF ((2m)n) using computer algebra techniques
Galois field computations abound in many applications, such as in cryptography, error correction codes, signal processing, among many others. Multiplication usually lies at the core of such Galois field computations, and is one of the most complex operations. Hardware implementations of such multipliers become very expensive. Therefore, there have been efforts to reduce the design complexity by...
متن کاملRate $(n-1)/n$ Systematic MDS Convolutional Codes over $GF(2^m)$
A systematic convolutional encoder of rate (n− 1)/n and maximum degree D generates a code of free distance at most D = D+ 2 and, at best, a column distance profile (CDP) of [2,3, . . . ,D ]. A code is Maximum Distance Separable (MDS) if it possesses this CDP. Applied on a communication channel over which packets are transmitted sequentially and which loses (erases) packets randomly, such a code...
متن کاملOn Testing Computability by Small Width OBDDs
We take another step in the study of the testability of small-width OBDDs, initiated by Ron and Tsur (Random’09). That is, we consider algorithms that, given oracle access to a function f : {0, 1}n → {0, 1}, need to determine whether f can be implemented by some restricted class of OBDDs or is far from any such function. Ron and Tsur showed that testing whether a function f : {0, 1}n → {0, 1} i...
متن کاملPerformance Comparison of Symbol- and Bit-Interleaving of Block Codes over GF(2m) on Fading Channels
We analytically compare the word error probabilities of imperfectly symboland bit-interleaved block codes over GF(2m) on fading channels. We employ an approximate fading channel model of a two-state Markov chain, using statistics of the fadeand interfadedurations. The analytical method is based on a technique developed in [2]. Expressions are derived for two decoding strategies; independent bou...
متن کاملNew AB2 Multiplier over GF(2m) using Cellular Automata
AB multiplication over GF(2) is an essential operation in modular exponentiation, which is the basic computation for most public key crypto systems. The current paper presents a new architecture that can perform AB multiplication over GF(2) in m clock cycles using a cellular automata. Since cellular automata architecture is simple, regular, modular, and cascadable, it can be utilized efficientl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Intelligent Information Management
دوره 2 شماره
صفحات -
تاریخ انتشار 2010